Lower connectivities of regular graphs with small diameter
نویسندگان
چکیده
منابع مشابه
Lower connectivities of regular graphs with small diameter
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with diameter D at most 3 has (vertex-)connectivity κ at least 2, and if D ≤ 2 then the connectivity is at least κ ≥ min{δ, 3}. Likewise, Soneoka, Nakada, Imase and Peyrat [Sufficient conditions for maximally connected graphs,...
متن کاملSuperconnectivity of regular graphs with small diameter
A graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vertices adjacent with one vertex. In this paper we prove for any r-regular graph of diameter D and odd girth g that if D ≤ g − 2, then the graph is super-κ when g ≥ 5 and a complete graph otherwise.
متن کاملTight Distance-regular Graphs with Small Diameter
We prove the following bound for a k regular graph on n vertices with nontrivial eigenvalues from the interval r s n k rs k r k s Equality holds if and only if the graph is strongly regular with eigenvalues in fk s rg Nonbipartite distance regular graphs with diameter d and eigenvalues k d whose local graphs satisfy the above bound with equality for s b and r b d are called tight graphs and are...
متن کاملAsymptotic Numbers of General 4-regular Graphs with given Connectivities
Let g(n, l1, l2, d, t, q) be the number of general 4-regular graphs on n labelled vertices with l1 + 2l2 loops, d double edges, t triple edges and q quartet edges. We use inclusion and exclusion with five types of properties to determine the asymptotic behavior of g(n, l1, l2, d, t, q) and hence that of g(2n), the total number of general 4-regular graphs where l1, l2, d, t and q = o( √ n), resp...
متن کاملNumber Theoretic Designs for Directed Regular Graphs of Small Diameter
In 1989, F. R. K. Chung gave a construction for certain directed h-regular graphs of small diameter. Her construction is based on finite fields, and the upper bound on the diameter of these graphs is derived from bounds for certain very short character sums. Here we present two similar constructions that are based on properties of discrete logarithms and exponential functions in residue rings m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.11.062